Uncertainty for Anonymity and 2%2DDimensional Range Query Distortion.

A data perturbation approach to sensitive classification rule hiding.

Providing K%2DAnonymity in location based services.

Reconstruction%2Dbased Classification Rule Hiding through Controlled Data Modification.

Privacy Preserving Record Linkage Using Phonetic Codes.

PLOT Privacy in Location Based Services An Open%2DEnded Toolbox.

Identifying Unsafe Routes for Network%2DBased Trajectory Privacy.
In this paper, we propose a privacy model that offers trajectory privacy to the requesters of Location-Based Services (LBSs), by utilizing an underlying network of user movement. The privacy model has been implemented as a framework that (i) reconstructs the user movement from a series of independent location updates, (ii) identifies routes where user privacy is at risk, and (iii) anonymizes online user requests for LBSs to protect the requester for as long as the service withstands completion. In order to achieve (iii), we propose two anonymization techniques, the K–present (weak) and the K–frequent (strong) trajectory anonymity, and a second chance approach that takes over when anonymization fails to ensure that the privacy of the user is preserved. To the best of our knowledge, this is the first work to propose a trajectory privacy model that utilizes an underlying network of user movement to offer in an interactive way personalized privacy to online user requests on trajectory data. 1
An overview of privacy preserving data mining.
Privacy-preserving data mining (PPDM) is an emergent research area that addresses the incorporation of privacy preserving concerns to data mining techniques. In this paper we propose a privacy-preserving (PP) Cox model for survival analysis, and consider a real clinical setting where the data is horizontally distributed among different institutions. The proposed model is based on linearly projecting the data to a lower dimensional space through an optimal mapping obtained by solving a linear programming problem. Our approach differs from the commonly used random projection approach since it instead finds a projection that is optimal at preserving the properties of the data that are important for the specific problem at hand. Since our proposed approach produces an sparse mapping, it also generates a PP mapping that not only projects the data to a lower dimensional space but it also depends on a smaller subset of the original features (it provides explicit feature selection). Real data from several European healthcare institutions are used to test our model for survival prediction of non-small-cell lung cancer patients. These results are also confirmed using publicly available benchmark datasets. Our experimental results show that we are able to achieve a near-optimal performance without directly sharing the data across different data sources. This model makes it possible to conduct large-scale multi-centric survival analysis without violating privacy-preserving requirements.
A network aware privacy model for online requests in trajectory data.

Exact Knowledge Hiding through Database Extension.

Privacy preserving record linkage approaches.

Exact Knowledge Hiding in Transactional Databases.

Hiding sensitive knowledge without side effects.

Optimal Stopping A Record%2DLinkage Approach.

Hiding sensitive knowledge without side effects.

A Free Terrain Model for Trajectory K%2DAnonymity.

A Parallelization Framework for Exact Knowledge Hiding in Transactional Databases.

Privacy Protection Regulations and Technologies%2C Opportunities and Threats.

Privacy and Security in Spatiotemporal Data and Trajectories.

Privacy in Spatiotemporal Data Mining.

A MaxMin approach for hiding frequent itemsets.

A privacy%2Daware trajectory tracking query engine.

A k%2DAnonymity Model for Spatio%2DTemporal Data.

A Hybrid Approach to Frequent Itemset Hiding.

Efficient algorithms for distortion and blocking techniques in association rule hiding.

Duplicate Record Detection A Survey.
Often, in the real world, entities have two or more representations in databases. Duplicate records do not share a common key and/or they contain errors that make duplicate matching a dif cult task. Errors are introduced as the result of transcription errors, incomplete information, lack of standard formats or any combination of these factors. In this article, we present a thorough analysis of the literature on duplicate record detection. We cover similarity metrics that are commonly used to detect similar eld entries, and we present an extensive set of duplicate detection algorithms that can detect approximately duplicate records in a database. We also cover multiple techniques for improving the ef ciency and scalability of approximate duplicate detection algorithms. We conclude with a coverage of existing tools and with a brief discussion of the big open problems in the area. Index Terms duplicate detection, data cleaning, data integration, record linkage, data deduplication, instance
An integer programming approach for frequent itemset hiding.
Abstract — Information era has eye witnessed an implausible explosion of a waft similar to a typhoon of techniques for data garnering, data dissemination, internet technologies and the manifestation of susceptible applications; privacy and security issues in knowledge discovery have reached the pinnacle opening a new sphere of influence of issue connecting to privacy of populace which requires solemn judgment. Hence forth we are pressurized to develop mechanism for altering the unique facts by some means, with the intention that the private data and private knowledge linger private even subsequent to the mining process. There are many mechanisms which have been adopted for privacy preserving data mining. Pinning our attention to the earlier works done for association rule hiding by Aris Gkoulalas et al., is based on the concept of distance flanked by the original database and its sanitized version, where all sensitive rules have
A Max%2DMin Approach for Hiding Frequent Itemsets.

An Experimental Study of Distortion%2DBased Techniques for Association Rule Hiding.

A Generalized Cost Optimal Decision Model for Record Matching.

A quantitative and qualitative ANALYSIS of blocking in association rule hiding.
ABSTRACT 1 Data mining provides the opportunity to extract useful information from large databases. Various techniques have been proposed in this context in order to extract this information in the most efficient way. However, efficiency is not our only concern in this study. The security and privacy issues over the extracted knowledge must be seriously considered as well. By taking this into consideration, we study the procedure of hiding sensitive association rules in binary data sets by blocking some data values and we present an algorithm for solving this problem. We also provide a fuzzification of the support and the confidence of an association rule in order to accommodate for the existence of blocked/unknown values. In addition, we quantitatively compare the proposed algorithm with other already published algorithms by running experiments on binary data sets, and we also qualitatively compare the efficiency of the proposed algorithm in hiding association rules. We utilize the notion of border rules, by putting weights in each rule, and we use effective data structures for the representation of the rules so as (a) to minimize the side effects created by the hiding process and (b) to speed up the selection of the victim transactions. Finally, we discuss the advantages and the limitations of blocking. Categories &amp; Subject Descriptors
Association Rule Hiding.
Large repositories of data contain sensitive information that must be protected against unauthorized access. The protection of the confidentiality of this information has been a long-term goal for the database security research community and for the government statistical agencies. Recent advances in data mining and machine learning algorithms, have increased the disclosure risks that one may encounter when releasing data to outside parties. A key problem, and still not sufficiently investigated, is the need to balance the confidentiality of the disclosed data with the legitimate needs of the data users. Every disclosure limitation method affects, in some way, and modifies true data values and relationships. In this paper, we investigate confidentiality issues of a broad category of rules, the association rules. In particular, we present three strategies and five algorithms for hiding a group of association rules, which is characterized as sensitive. One rule is characterized as sensitive if its disclosure risk is above a certain privacy threshold. Sometimes, sensitive rules should not be disclosed to the public, since among other things, they may be used for inferring sensitive data, or they may provide business competitors with an advantage. We also perform an extensive validation and evaluation study of the hiding algorithms, in order to analyze their time complexity and the impact that they have in the original database. Index Terms- Privacy preserving data mining, association rule mining, sensitive rule hiding. 1
State%2Dof%2Dthe%2Dart in privacy preserving data mining.
We provide here an overview of the new and rapidly emerging research area of privacy preserving data mining. We also propose a classification hierarchy that sets the basis for analyzing the work which has been performed in this context. A detailed review of the work accomplished in this area is also given, along with the coordinates of each work to the classification hierarchy. A brief evaluation is performed, and some initial conclusions are made.
A Knowledge Discovery Methodology for Behavior Analysis of Large%2Dscale Applications on Parallel Architectures.

Improving Data Quality in Practice A Case Study in the Italian Public Administration.

A Bayesian decision model for cost optimal record matching.

TAILOR A Record Linkage Tool Box.

Privacy Preserving Association Rule Mining.
The current trend in the application space towards systems of loosely coupled and dynamically bound components that enables just-in-time integration jeopardizes the security of information that is shared between the broker, the requester, and the provider at runtime. In particular, new advances in data mining and knowledge discovery, that allow for the extraction of hidden knowledge in enormous amount of data, impose new threats on the seamless integration of information. In this paper, we consider the problem of building privacy preserving algorithms for one category of data mining techniques, the association rule mining. We introduce new metrics in order to demonstrate how security issues can be taken into consideration in the general framework of association rule mining, and we show that the complexity of the new heuristics is similar to this of the original algorithms.
MyPYTHIA a recommendation portal for scientific software and services.
In this paper, we outline the design of a recommendation system (MyPYTHIA) implemented as a web portal.  MyPYTHIA&#039;s design objectives include evaluating the quality and performance of scientific software on grid  platforms, creating knowledge about which software and computational services should be selected for solving  particular problems, selecting parameters of software (or of computational services) based on user-specified  computational objectives, providing access to performance data and knowledge bases over the web, and enabling  recommendations for targeted application domains. MyPYTHIA uses a combination of statistical analysis, pattern  extraction techniques, and a database of software performance to map feature-based representations of problem  instances to appropriate software. MyPYTHIA&#039;s open architecture allows the user to customize it for conducting  individual case studies. We describe the architecture as well as several scientific domains of knowledge enabled  by such case studies.    This work was supported in part by NSF grant CDA 91-23502, PRF 6902851, DARPA grant N66001-97-C-8533 (Navy), DOE LG-6982, DARPA under ARO grant DAAH04-94-G-0010, and the Purdue Research Foundation.  1  Contents  1 
Hiding Association Rules by Using Confidence and Support.
Large repositories of data contain sensitive information which must be protected against unauthorized access. The protection of the confidentiality of this information has been a long-term goal for the database security research community and the government statistical agencies. Recent advances, in data mining and machine learning algorithms, have increased the disclosure risks one may encounter when releasing data to outside parties.
Automating the analysis of option pricing algorithms through intelligent knowledge acquisition approaches.
The traditional approach for estimating the performance of numerical methods is to combine an operation&#039;s count with an asymptotic error analysis. This analytic approach gives a general feel of the comparative efficiency of methods, but it rarely leads to very precise results. It is now recognized that accurate performance evaluation can be made only with actual measurements on working software. Given that such an approach requires an enormous amount of performance data related to actual measurements, the development of novel approaches and systems that intelligently and efficiently analyze these data is of great importance to scientists and engineers.
Using Unknowns to Prevent Discovery of Association Rules.

On the Accuracy and Completeness of the Record Matching Process.
The role of data resources in today&#039;s business environment is  multi-faceted. Primarily, they support the operational needs of an organization  or a company. Secondarily, they can be used for decision support and  management. The quality of the data, used to support the operational needs,  is usually below the quality required for decision support and management.
PYTHIA%2DII a knowledge%2Fdatabase system for managing performance data and recommending scientific software.
this paper, we describe the PYTHIA-II architecture and its use as an RS for PDE software.
Automating the approximate record%2Dmatching process.
Data Quality has many dimensions one of which is accuracy. Accuracy is usually compromised by errors accidentally or intensionally introduced in a database system. These errors result in inconsistent, incomplete, or erroneous data elements. For example, a small variation in the representation of a data object, produces a unique instantiation of the object being represented. In order to improve the accuracy of the data stored in a database system, we need to compare them either with real-world counterparts or with other data stored in the same or a different system. In this paper we address the problem of matching records which refer to the same entity by computing their similarity. Exact record matching has limited applicability in this context since even simple errors like character transpositions cannot be captured in the record linking process. Our methodology deploys advanced data mining techniques for dealing with the high computational and inferential complexity of approximate record matching.
BIND A Biomedical INteroperable Database System.

On the Testability of Purely Recursive Digital Filters.

